Modified Page Rank Algorithm to Solve Ambiguity of Polysemous Words
نویسندگان
چکیده
منابع مشابه
Using Modified IPSO-SQP Algorithm to Solve Nonlinear Time Optimal Bang-Bang Control Problem
In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...
متن کاملModified cuckoo optimization algorithm (MCOA) to solve graph coloring problem
In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...
متن کاملEvaluation of the Regularization Algorithm to Decorrelation of Covariance Matrix of Float Ambiguity in Fast Resolution of GPS Ambiguity Parameters
Precise positioning in Real Time Kinematic (RTK) applications depends on the accurate resolution of the phase ambiguities. In RTK positioning, ambiguity parameters are highly correlated, especially when the positioning rate is high. Consequently, application of de-correlation techniques for the accurate resolution of ambiguities is inevitable. Phase ambiguity as positioning observations by the ...
متن کاملLecture 3 — Page Rank 1 Calculating Page Rank
The combination of the bag-of-words representation, cosine distance, and inverse document frequency weighting forms the core of lots of information retrieval systems, because it works pretty well. However, there is more information in and about many documents than just this, and that too can be exploited in search. Today's lecture is about one of the most successful of these, which is to use li...
متن کاملPage Rank Prefetching for Optimzing Accesses to Web Page Clusters
This paper presents a Page Rank based prefetching technique for accesses to web page clusters. The approach uses the link structure of a requested page to determine the “most important” linked pages and to identify the page(s) to be prefetched. The underlying premise of our approach is that in the case of cluster accesses, the next pages requested by users of the web server are typically based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Cybernetics & Informatics
سال: 2013
ISSN: 2320-8430,2277-548X
DOI: 10.5121/ijci.2013.2202